#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    int n = 7;

    V<int> w(n + 1, 0);

    FOR(i, 1, n) cin >> w[i];

    FOR(a, 1, n) {
        FOR(b, a + 1, n) {
            FOR(c, b + 1, n) {
                int t1 = w[a], t2 = w[b], t3 = w[c];
                V<int> e(n + 1, 0);
                e[1] = t1, e[2] = t2, e[3] = t3, e[4] = t1 + t2, e[5] = t1 + t3, e[6] = t2 + t3, e[7] = t1 + t2 + t3;
                sort(ALL(e));
                if (e == w) {
                    cout << t1 << ' ' << t2 << ' ' << t3 << endl;
                    RE;
                }
            }
        }
    }
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> Task;
    while (Task--) {
        solve();
    }

    return 0;
}
